package com.briup.day02.test;

import java.util.Scanner;

/**
 * @Auther: hjy(lc))
 * @Date: 2022/7/18-07-18-9:40
 * @Description：com.briup.day02.test
 * 生成文档Api命令：javadoc -d api -author -version -encoding UTF-8
 */
public class hello {

    public static void main(String[] args) {

        int n;
        long count =0;
        Scanner sc = new Scanner(System.in);
        n = sc.nextInt();
        long[][] num = new long[n][2];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < 2; j++) {
                num[i][j] = sc.nextLong();
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = i+1; j < n; j++) {
                long x1y1 = num[i][0]*num[j][1];
                long x2y1 = num[j][0]*num[i][1];
                for (int k = j; k < n; k++) {
                    long s = x1y1+num[j][0]*num[k][1]+num[k][0]*num[i][1]
                            -num[i][0]*num[k][1]-x2y1-num[k][0]*num[j][1];
                    if(s%2!=0){
                        count++;
                    }
                }
            }
        }
        System.out.println(count);
    }
}
